ERDF Implementation and Evaluation
نویسندگان
چکیده
SQL, Prolog, RDF and OWL are among the most prominent and most widely used computational logic languages. SQL, Prolog and RDF do not allow to represent negative information, only OWL does so. RDF does even not include any negation concept. While SQL and Prolog only support reasoning with closed predicates based on negation-as-failure, OWL supports reasoning with open predicates based on classical negation, only. However, in many practical application contexts, one rather needs support for reasoning with both open and closed predicates. To support this claim, we show that the well-known Web vocabulary FOAF includes three kinds of predicates, which we call closed, open and partial predicates. Therefore, reasoning with FOAF data, as a typical example of reasoning on the Web, requires a formalism that supports the distinction between open and closed predicates. We argue that ERDF, an extension of RDF, offers a solution to deal with this problem. Keyword List Rule, Reasoning, JenaRules, RDF(S), ERDF, SPARQL, FOAF. Project co-funded by the European Commission and the Swiss Federal Office for Education and Science within the Sixth Framework Programme.
منابع مشابه
eRDF: A scalable framework for querying the Web of Data
As the Web of Data increases in data size, speed of updates, and heterogeneity, new mechanisms are needed in order to query it effectively. In this paper, we detail eRDF: a novel framework based on evolutionary methods that enables queries over the live Web of Data. We define the problem of finding approximate solutions for queries on the Web of Data as a constrained optimisation problem. Based...
متن کاملA Formal Theory for Modular ERDF Ontologies
The success of the Semantic Web is impossible without any form of modularity, encapsulation, and access control. In an earlier paper, we extended RDF graphs with weak and strong negation, as well as derivation rules. The ERDF #n-stable model semantics of the extended RDF framework (ERDF) is defined, extending RDF(S) semantics. In this paper, we propose a framework for modular ERDF ontologies, c...
متن کاملOn the Computability and Complexity Issues of Extended RDF
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a ...
متن کاملTowards a Mapping from ERDF(S) to Take Vocabulary
This paper presents a mapping solution from ERDF(S) to Take vocabulary. The work is related to an investigation of integrating ERDF Derivation Rules into Take inference engine. Some steps are required to finalize this task: a mapping between ERDF(S) and Take vocabulary, integration of ERDF knowledge base in Take, and empowering Take inference engine to deal with both Closed World Assumption and...
متن کاملComputability and Complexity Issues of Extended RDF
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. Unfortunately, ERDF stable model semantics is in general undecidable. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008